Cost Effective Domination in the Join, Corona and Composition of Graphs

Secure Restrained Domination in the Join and Corona of Graphs

Let G be a connected simple graph. A restrained dominating set S of the vertex set of G, V (G) is a secure restrained dominating set of G if for each u ∈ V (G) \ S, there exists v ∈ S such that uv ∈ E(G) and the set (S \ {v}) ∪ {u} is a restrained dominating set of G. The minimum cardinality of a secure restrained dominating set of G, denoted by γsr(G), is called the secure restrained dominatio...

SIGNED ROMAN DOMINATION NUMBER AND JOIN OF GRAPHS

In this paper we study the signed Roman dominationnumber of the join of graphs. Specially, we determine it for thejoin of cycles, wheels, fans and friendship graphs.

Global Defensive Alliances in the Join, Corona and Composition of Graphs

Binding Number of Corona and Join of Graphs

The binding number of a graph G is defined as bind(G) = min |N(S)| |S| , S ∈ F (G) where F (G) = {S ⊆ V (G) : S = ∅ and N(S) = V (G)}. This paper provides some results on the binding numbers of corona and join of graphs and characterize them in terms of independent binding set. Mathematics Subject Classification: 05C69

Signed Roman Domination Number and Join of Graphs

In this work, we study the signed Roman domination number of the join of graphs. Specially, we determine it for the join of cycles, wheels, fans, and friendship graphs.